某类多叶解析函数的性质

设A(p)(p是指数，p≥1）表示在单位圆盘E内形如f(z)=z^p ap 1z^p 1…的解析函数族。本文引进了新的函数子类Hσ（p,α），找出了Hσ（p,α）闭凸包的极值点并给出精确的系数估计，还讨论了Hσ（p,α）其它一些有趣的性质。     

广义对角占优矩阵的充分条件

广义对角占优势矩阵及M-矩阵是计算数学和矩阵理论研究的重要课题之一。本文利用α-对角占优矩阵给出了判定广义对角占优及非异M-矩阵的若干充分条件，改进了文[1]及文[2]的相应的结果，作为应用，利用矩阵分块又给矩阵非奇异若干判定条件。     

On Factorizations of Smooth Nonnegative Matrix-Values Functions and on Smooth Functions with Values in Polyhedra

We discuss the possibility to represent smooth nonnegative matrix-valued functions as finite linear combinations of fixed matrices with positive real-valued coefficients whose square roots are Lipschitz continuous. This issue is reduced to a similar problem for smooth functions with values in a polyhedron. The work was partially supported by NSF Grant DMS-0653121.     

Embedding theorems in the Sobolev-Morrey type spaces S p,a,ℵτ W W(G) with dominant mixed derivatives

We construct Sobolev-Morrey type spaces with dominant mixed derivatives and, using the obtained integral representation, prove some embedding theorems in these spaces.     

非奇H-矩阵的实用性新判定

给出了非奇H矩阵几个新的实用性判据,改进了近期的一些结果,并给出相应数值例子来说明结果的有效性.     

非广义对角占优矩阵的判定准则

给出了判定非广义对角占优矩阵的充要条件,从理论上彻底解决了不可约非广义对角占优矩阵的判定问题,并给出了判定不可约非广义对角占优矩阵的具体算法.     

广义对角占优矩阵的判定准则

In this paper,some new sufficient conditions for generalized dominant matrices are given,and some results in [1] are generalized and improved.     

局部双对角占优矩阵的注记

1引言非奇异H矩阵是计算数学、数学物理、控制论等领域中具有广泛应用的重要矩阵类,研究其充分条件自然引起人们的兴趣．文[1]中定义了一类局部双对角占优矩阵,并由此得到了非奇异H矩阵的判别方法．我们指出,文[1]所获充分条件中所给出的四个不等式条件,其中第四个不等式条件可蕴涵其余三个,进而定义了另一类局部双对角占优矩阵,并由此获得了非奇异H矩阵新的判别方法．设A=(a_(ij))∈C~(n×n),R_i(A)=sum from j≠i|a_(ij)|,i∈N={1,2,…,n}．若|a_(ii)|≥R_i(A),(?)i∈N,则称A为对角占优矩阵,记为A∈D_o;若不等式中每个不等号都是严格的,则称A为     

Rounding Errors in Solving Block Hessenberg Systems

A rounding error analysis is presented for a divide-and-conquer algorithm to solve linear systems with block Hessenberg matrices. Conditions are derived under which the algorithm computes a stable solution. The algorithm is shown to be stable for block diagonally dominant matrices and for M-matrices.

     

Admission control of multi-class traffic with service priorities in high-speed networks

We consider a fluid model of a system that handles multiple classes of traffic. The delay and cell-loss requirements of the different classes of traffic are generally widely different and are achieved by assigning different buffers for different classes, and serving them in a strict priority order. We use results from the effective bandwidth of the output processes (see Chang and Thomas (1995)) to derive simple and asymptotically exact call-admission policies for such a system to guarantee the cell-loss requirements for the different classes assuming that each source produces a single class traffic. We compare the admission-control policies developed here with the approximate policy studied by Elwalid and Mitra (1995) for the case of two-class traffic. This revised version was published online in June 2006 with corrections to the Cover Date.